## Uses of Class
oracle.pgx.api.PgxEdge

- Packages that use PgxEdge
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.

- - ### Uses of PgxEdge in oracle.pgx.api

    Methods in oracle.pgx.api that return PgxEdge
    Modifier and Type | Method and Description
    --- | ---
    `PgxEdge` | PgxGraph.`getEdge(long id)` Gets a `PgxEdge` of this graph by ID.

    Methods in oracle.pgx.api that return types with arguments of type PgxEdge
    Modifier and Type | Method and Description
    --- | ---
    `PgxPath.PathIterable<PgxEdge>` | PgxPath.`getEdges()` Gets the edges of this path.

    Methods in oracle.pgx.api with parameters of type PgxEdge
    Modifier and Type | Method and Description
    --- | ---
    `int` | PgxEdge.`compareTo(PgxEdge o)`

    Method parameters in oracle.pgx.api with type arguments of type PgxEdge
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> AllPaths<ID>` | PgxGraph.`createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createAllPathsAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | PgxGraph.`createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `AllPaths` object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> PgxPath<ID>` | PgxGraph.`createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createPathAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | PgxGraph.`createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `PgxPath` object representing the shortest path from one source to one destination (shortest regarding the given edge costs).

Copyright © 2015. All rights reserved.